Rank correlation between centrality metrics in complex networks: an empirical study

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Correlation Analysis between Maximal Clique Size and Centrality Metrics for Random Networks and Scale-Free Networks

The high-level contribution of this paper is a comprehensive analysis of the correlation levels between node centrality (a computationally light-weight metric) and maximal clique size (a computationally hard metric) in random network and scale-free network graphs generated respectively from the well-known Erdos-Renyi (ER) and Barabasi-Albert (BA) models. We use three well-known measures for eva...

متن کامل

Subgraph centrality in complex networks.

We introduce a new centrality measure that characterizes the participation of each node in all subgraphs in a network. Smaller subgraphs are given more weight than larger ones, which makes this measure appropriate for characterizing network motifs. We show that the subgraph centrality [C(S)(i)] can be obtained mathematically from the spectra of the adjacency matrix of the network. This measure ...

متن کامل

Controlling centrality in complex networks

Dipartimento di Fisica ed Astronomia, Università di Catania, and INFN Sezione di Catania, 95123, Catania, Italy, Laboratorio sui Sistemi Complessi, Scuola Superiore di Catania, Università di Catania, 95123, Catania, Italy, Departamento de Matemática Aplicada, Universidad Rey Juan Carlos, 28933, Madrid, Spain, Dipartimento di Matematica e Informatica, Università di Catania, Via S., Sofia, 64, 95...

متن کامل

Betweenness centrality correlation in social networks.

Scale-free (SF) networks exhibiting a power-law degree distribution can be grouped into the assortative, dissortative, and neutral networks according to the behavior of the degree-degree correlation coefficient. Here we investigate the betweenness centrality (BC) correlation for each type of SF networks. While the BC-BC correlation coefficients behave similarly to the degree-degree correlation ...

متن کامل

From centrality to temporary fame: Dynamic centrality in complex networks

We develop a new approach to the study of the dynamics of link utilization in complex networks using records of communication in a large social network. Counter to the perspective that nodes have particular roles, we find roles change dramatically from day to day. “Local hubs” have a power law degree distribution over time, with no characteristic degree value. Our results imply a significant re...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Open Physics

سال: 2018

ISSN: 2391-5471

DOI: 10.1515/phys-2018-0122